package LeetCode.LeetCode2;

class Num11 {
    public int minArray(int[] numbers) {
        if(numbers.length == 0){
            return -1;
        }
        if(numbers.length == 1){
            return numbers[0];
        }
        int minNum = numbers[0];
        for(int i = 1;i < numbers.length;i++){
            if(numbers[i] > minNum){
                continue;
            }else{
                minNum = numbers[i];
            }
        }
        return minNum;


    }
}
